An improved TFIDF algorithm based on dual parallel adaptive computing model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Image Segmentation Algorithm Based on GPU Parallel Computing

In the process of image segmentation, the classic Fuzzy C-Means (FCM) algorithm is time-consuming and depends heavily on initialization center. Based on Graphic Processing Unit (GPU), this paper proposes a novel FCM algorithm by improving the computational formulas of membership degree and the update criterion of cluster centers. Our algorithm can initialize cluster centers purposefully and fur...

متن کامل

An Adaptive Parallel Algorithm for Computing Connectivity

Computing connected components in undirected graphs is a fundamental problem in graph analytics. The size of graph data collections continues to grow in many different scientific domains, which motivates the need for high performance distributed memory parallel graph algorithms, especially for large networks that cannot fit into the memory of a single compute node. For a graph G(V,E) with n ver...

متن کامل

A Tree Algorithm Based on Parallel Cloud Computing Model

Cloud computing is the development of parallel computing, distributed computing and grid computing, and with the advancement of cloud computing, how to design efficient distributed tree algorithm is receiving more and more attention, Constrained by parallel assumption, Parallel tree algorithm are not easy to express in MapReduce. Inspired by Bulk Synchronous Parallel model, we propose an enhanc...

متن کامل

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

An improved Thomas Algorithm for finite element matrix parallel computing

With the expansion of the scale of linear finite element analyzing data, efficiency of computation is a main technical bottleneck. For solving the bottleneck, parallel computation is playing an increasingly prominent role. At present, the researches on linear finite element parallel computation are mainly concentrated on the preprocessing phase, and goal of these researches is to reduce the com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Embedded Systems

سال: 2020

ISSN: 1741-1068,1741-1076

DOI: 10.1504/ijes.2020.108278